0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.34 % Computer : n026.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 15:57:59 EDT 2021 0.13/0.34 % CPUTime : 0.13/0.35 % Number of cores: 8 0.13/0.35 % Python version: Python 3.6.8 0.13/0.35 # Version: 2.6rc1-ho 0.13/0.37 # No SInE strategy applied 0.13/0.37 # Trying AutoSched0 for 59 seconds 59.12/59.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S2g 59.12/59.45 # and selection function SelectCQArNpEqFirst. 59.12/59.45 # 59.12/59.45 # Preprocessing time : 2.384 s 59.12/59.45 # Presaturation interreduction done 59.24/59.56 # No success with AutoSched0 59.24/59.56 # Trying AutoSched1 for 26 seconds 61.71/62.02 # AutoSched1-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN 61.71/62.02 # and selection function PSelectComplexExceptUniqMaxHorn. 61.71/62.02 # 61.71/62.02 # Preprocessing time : 2.446 s 61.71/62.02 61.71/62.02 # Proof found! 61.71/62.02 # SZS status Theorem 61.71/62.02 # SZS output start CNFRefutation 61.71/62.02 thf(conj_0, conjecture, late_transitions @ (par @ (par @ p @ q) @ r) @ (late_FreeR @ late_TauR @ (par @ (par @ p2 @ (subs @ q2 @ x @ b)) @ r)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 61.71/62.02 thf(fact_11_Par1F, axiom, ![X6:pi, X7:late_freeRes, X8:pi, X37:pi]:(late_transitions @ X6 @ (late_FreeR @ X7 @ X8)=>late_transitions @ (par @ X6 @ X37) @ (late_FreeR @ X7 @ (par @ X8 @ X37))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_11_Par1F)). 61.71/62.02 thf(fact_3__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_H_091x_058_058_061b_093_092_060close_062, axiom, late_transitions @ (par @ p @ q) @ (late_FreeR @ late_TauR @ (par @ p2 @ (subs @ q2 @ x @ b))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_3__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_H_091x_058_058_061b_093_092_060close_062)). 61.71/62.02 thf(c_0_3, negated_conjecture, ~late_transitions @ (par @ (par @ p @ q) @ r) @ (late_FreeR @ late_TauR @ (par @ (par @ p2 @ (subs @ q2 @ x @ b)) @ r)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 61.71/62.02 thf(c_0_4, plain, ![X2781:pi, X2782:late_freeRes, X2783:pi, X2784:pi]:(~late_transitions @ X2781 @ (late_FreeR @ X2782 @ X2783)|late_transitions @ (par @ X2781 @ X2784) @ (late_FreeR @ X2782 @ (par @ X2783 @ X2784))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_11_Par1F])])). 61.71/62.02 thf(c_0_5, negated_conjecture, ~late_transitions @ (par @ (par @ p @ q) @ r) @ (late_FreeR @ late_TauR @ (par @ (par @ p2 @ (subs @ q2 @ x @ b)) @ r)), inference(split_conjunct,[status(thm)],[c_0_3])). 61.71/62.02 thf(c_0_6, plain, ![X6:pi, X7:late_freeRes, X15:pi, X8:pi]:(late_transitions @ (par @ X6 @ X15) @ (late_FreeR @ X7 @ (par @ X8 @ X15))|~late_transitions @ X6 @ (late_FreeR @ X7 @ X8)), inference(split_conjunct,[status(thm)],[c_0_4])). 61.71/62.02 thf(c_0_7, plain, late_transitions @ (par @ p @ q) @ (late_FreeR @ late_TauR @ (par @ p2 @ (subs @ q2 @ x @ b))), inference(split_conjunct,[status(thm)],[fact_3__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_H_091x_058_058_061b_093_092_060close_062])). 61.71/62.02 thf(c_0_8, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])]), ['proof']). 61.71/62.02 # SZS output end CNFRefutation 61.71/62.02 # Proof object total steps : 9 61.71/62.02 # Proof object clause steps : 4 61.71/62.02 # Proof object formula steps : 5 61.71/62.02 # Proof object conjectures : 4 61.71/62.02 # Proof object clause conjectures : 2 61.71/62.02 # Proof object formula conjectures : 2 61.71/62.02 # Proof object initial clauses used : 3 61.71/62.02 # Proof object initial formulas used : 3 61.71/62.02 # Proof object generating inferences : 1 61.71/62.02 # Proof object simplifying inferences : 2 61.71/62.02 # Training examples: 0 positive, 0 negative 61.71/62.02 # Parsed axioms : 500 61.71/62.02 # Removed by relevancy pruning/SinE : 0 61.71/62.02 # Initial clauses : 29826 61.71/62.02 # Removed in clause preprocessing : 167 61.71/62.02 # Initial clauses in saturation : 29659 61.71/62.02 # Processed clauses : 190 61.71/62.02 # ...of these trivial : 0 61.71/62.02 # ...subsumed : 4 61.71/62.02 # ...remaining for further processing : 186 61.71/62.02 # Other redundant clauses eliminated : 12 61.71/62.02 # Clauses deleted for lack of memory : 0 61.71/62.02 # Backward-subsumed : 0 61.71/62.02 # Backward-rewritten : 0 61.71/62.02 # Generated clauses : 211 61.71/62.02 # ...of the previous two non-trivial : 152 61.71/62.02 # Contextual simplify-reflections : 0 61.71/62.02 # Paramodulations : 86 61.71/62.02 # Factorizations : 0 61.71/62.02 # NegExts : 0 61.71/62.02 # Equation resolutions : 17 61.71/62.02 # Propositional unsat checks : 0 61.71/62.02 # Propositional check models : 0 61.71/62.02 # Propositional check unsatisfiable : 0 61.71/62.02 # Propositional clauses : 0 61.71/62.02 # Propositional clauses after purity: 0 61.71/62.02 # Propositional unsat core size : 0 61.71/62.02 # Propositional preprocessing time : 0.000 61.71/62.02 # Propositional encoding time : 0.000 61.71/62.02 # Propositional solver time : 0.000 61.71/62.02 # Success case prop preproc time : 0.000 61.71/62.02 # Success case prop encoding time : 0.000 61.71/62.02 # Success case prop solver time : 0.000 61.71/62.02 # Current number of processed clauses : 184 61.71/62.02 # Positive orientable unit clauses : 48 61.71/62.02 # Positive unorientable unit clauses: 0 61.71/62.02 # Negative unit clauses : 61 61.71/62.02 # Non-unit-clauses : 75 61.71/62.02 # Current number of unprocessed clauses: 29621 61.71/62.02 # ...number of literals in the above : 320204 61.71/62.02 # Current number of archived formulas : 0 61.71/62.02 # Current number of archived clauses : 0 61.71/62.02 # Clause-clause subsumption calls (NU) : 1489 61.71/62.02 # Rec. Clause-clause subsumption calls : 1054 61.71/62.02 # Non-unit clause-clause subsumptions : 1 61.71/62.02 # Unit Clause-clause subsumption calls : 394 61.71/62.02 # Rewrite failures with RHS unbound : 0 61.71/62.02 # BW rewrite match attempts : 5 61.71/62.02 # BW rewrite match successes : 0 61.71/62.02 # Condensation attempts : 0 61.71/62.02 # Condensation successes : 0 61.71/62.02 # Termbank termtop insertions : 3017935 61.71/62.04 61.71/62.04 # ------------------------------------------------- 61.71/62.04 # User time : 60.655 s 61.71/62.04 # System time : 0.946 s 61.71/62.04 # Total time : 61.601 s 61.71/62.04 # Maximum resident set size: 3064 pages 61.71/62.04 EOF